/**
 * Given a binary tree, return the preorder traversal of its nodes' values.

For example:
Given binary tree {1,#,2,3},
   1
    \
     2
    /
   3
return [1,2,3]
 */
/**
 * @author I321035
 *
 */
package problem144_Binary_Tree_Preorder_Traversal;